Towards the Application of Association Rules for Defeasible Rule Discovery
نویسندگان
چکیده
In this paper we investigate the feasibility of Knowledge Discovery from Databases (KDD) in order to facilitate the discovery of defeasible rules that represent the ratio decidendi underpinning legal decision making. Moreover we will argue in favour of Defeasible Logic as an appropriate formal system in which the extracted principles should be encoded.
منابع مشابه
Association rule mining application to diagnose smart power distribution system outage root cause
Smart grid has been introduced to address power distribution system challenges. In conventional power distribution systems, when a power outage happens, the maintenance team tries to find the outage cause and mitigate it. After this, some information is documented in a dataset called the outage dataset. If the team can estimate the outage cause before searching for it, the restoration time will...
متن کاملDefeasible Logics
In this chapter, we will concentrate on the defeasible approach to nonmonotonic reasoning , as opposed to the minimalist approach and the fixpoint approach. Formalisms following the minimalist approach, like circumscription [McC80, McC86, Lif85], look at models of a classical theory that are minimal with respect to some set of predicates occurring in the theory. Fixpoint formalisms include McDe...
متن کاملDR-DEVICE: A Defeasible Logic RDF Rule Language
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally; and for the modeling of business rules and policies, where rules with exceptions are often used. In this demonstration we present a prototype system for defeasible rea...
متن کاملDefeasible AceRules: A Prototype
The paper adapts the syntax of the AceRules system, an existing controlled natural language (CNL), and pipes the resulting output rules to a defeasible inference engine. With this, we can represent and reason with knowledge bases (KB) with strict and defeasible rules. For strict rules, the consequent of a strict rule must hold if the premises hold; for a defeasible rule, the consequent of a def...
متن کاملNested Rules in Defeasible Logic
Defeasible Logic is a rule-based non-monotonic logic with tractable reasoning services. In this paper we extend Defeasible Logic with nested rules. We consider a new Defeasible Logic, called DLns, where we allow one level of nested rules. A nested rule is a rule where the antecedent or the consequent of the rule are rules themselves. The inference conditions for DLns are based on reflection on ...
متن کامل